Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation
نویسندگان
چکیده
منابع مشابه
On the Computation of Minimal Polynomial Bases
The problem of determination of a minimal polynomial basis of a rational vector space is the starting point of many control analysis, synthesis and design techniques. In this paper, we propose a new algorithm for the computation of a minimal polynomial basis of the left kernel of a given polynomial matrix F (s). The proposed method exploits the structure of the left null space of generalized W...
متن کاملA Polynomial Algorithm for Minimal Interval Representation
A three-dimensional object has many possible representations inside a computer. Specifically, constructive solid geometry, boundary representation, and volumetric approximation techniques are commonly used to represent objects in solid geometric modeling (see [4]). Among the volumetric schemes are the octree [3] and the more recently developed switching-function representation [6] in which the ...
متن کاملSymbolic Computation of Minimal Probabilistic Reachability∗
This paper continues our study of the verification problem for infinitestate systems featuring both nondeterministic and probabilistic choice. In an earlier paper we defined symbolic probabilistic systems, an extension of the framework of symbolic transition systems due to Henzinger et. al., and considered the problem of deciding the maximal probability of reaching a set of target states. A sym...
متن کاملComputation on Zagreb Polynomial of Some Families of Dendrimers
In mathematical chemistry, a particular attention is given to degree-based graph invariant. The Zagrebpolynomial is one of the degree based polynomials considered in chemical graph theory. A dendrimer isan artificially manufactured or synthesized molecule built up from branched units called monomers. Inthis note, the first, second and third Zagreb poly...
متن کاملNew algorithm for minimal solution of linear polynomial equations
plays central role in the linear control theory. It occurs in optimal control synthesis, in dead-beat as well as in quadratic criteria [1, 2, 3]. In this equation, a(X), b(X), c(X) are given polynomials, x(X), y(X) are unknown ones. We suppose a(X), b(X) are not both identically zero. Main tool for studying this Euclidean equation is the Euclidean algorithm. It yields general solution and can s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2016
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2015.06.005